Comparing Graphs of Different Sizes
نویسنده
چکیده
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of independent sets, among other combinatorial quantities. Our methods involve inequalities for determinants, for traces of functions of operators, and for entropy. §
منابع مشابه
Generalized Degree Distance of Strong Product of Graphs
In this paper, the exact formulae for the generalized degree distance, degree distance and reciprocal degree distance of strong product of a connected and the complete multipartite graph with partite sets of sizes m0, m1, . . . , mr&minus1 are obtained. Using the results obtained here, the formulae for the degree distance and reciprocal degree distance of the closed and open fence graphs are co...
متن کاملRefining the Hierarchies of Classes of Geometric Intersection Graphs
We analyse properties of geometric intersection graphs to show strict containment between some natural classes of geometric intersection graphs. In particular, we show the following properties: • A graph G is outerplanar if and only if the 1-subdivision of G is outer-segment. • For each integer k > 1, the class of intersection graphs of segments with k different lengths is a strict subclass of ...
متن کاملComparing Two Different Teaching Methods for Teaching the Dietary Exchange List to Students of Nutritional Science
Introduction: Considering the importance of learning dietary exchange list in academic nutrition education, teaching it gains significance, too. Thus, this study is going to compare two different teaching methods regarding dietary exchange list to students of nutritional science. Methods: This quasi-experimental study was conducted on 49 students of nutritional science in two semesters ...
متن کاملRamsey Graphs Induce Subgraphs of Many Different Sizes
A graph on n vertices is said to be C-Ramsey if every clique or independent set of the graph has size at most C log n. The only known constructions of Ramsey graphs are probabilistic in nature, and it is generally believed that such graphs possess many of the same properties as dense random graphs. Here, we demonstrate one such property: for any fixed C > 0, every C-Ramsey graph on n vertices i...
متن کاملA Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking
Despite of the fact that graph based methods are gaining more and more popularity in different scientific areas, it has to be considered that the choice of an appropriate algorithm for a given application is still the most crucial task. The lack of a large database of graphs makes the task of comparing the performance of different graph matching algorithms difficult, and often the selection of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 26 شماره
صفحات -
تاریخ انتشار 2017